Factorization of polynomials over finite fields - PDFSEARCH.IO - Document Search Engine

Factorization of polynomials over finite fields
Results: 34

#	Item
11	Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme P. Delsarte Philips Research Laboratory, Avenue Van Becelaere, 2 B-1170 Brussels, Belgium Y. Desmedt Add to Reading List Source URL: www.dtc.umn.edu Language: English - Date: 1998-04-13 22:10:00 Cryptography Finite fields Public-key cryptography Euclidean algorithm Factorization of polynomials over a finite field and irreducibility tests Mathematics Mathematical analysis Polynomials
12	The University of Hong Kong DEPARTMENT OF MATHEMATICS MATH3302/MATH4302 Algebra II Suggested Solution to Assignment 1 In the following, E, F, K are fields. 1. Let E, K be two field extensions of F . Add to Reading List Source URL: hkumath.hku.hk Language: English - Date: 2015-02-17 01:14:10 Field theory Euclidean algorithm Field extension Field Factorization of polynomials over a finite field and irreducibility tests Splitting field Abstract algebra Algebra Mathematics
13	The University of Hong Kong DEPARTMENT OF MATHEMATICS MATH3302/MATH4302 Algebra II Assignment 1 Due: Tuesday 1 pm, February 17, 2015. In the following, E, F, K are fields. Add to Reading List Source URL: hkumath.hku.hk Language: English - Date: 2015-02-02 23:06:33 Field extension Field Factorization of polynomials over a finite field and irreducibility tests Splitting field Abstract algebra Algebra Field theory
14	POLYNOMIAL INTERPOLATION AND IDENTITY TESTING FROM HIGH POWERS OVER FINITE FIELDS ´ GABOR IVANYOS, MAREK KARPINSKI, MIKLOS SANTHA, Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2015-02-23 03:32:48 Polynomials Field theory Polynomial interpolation Polynomial Finite field Minimal polynomial Symbol Rational function Factorization of polynomials over a finite field and irreducibility tests Abstract algebra Algebra Mathematics
15	Approximating the average stretch factor of geometric graphs∗ Siu-Wing Cheng† Christian Knauer‡ Stefan Langerman§ Michiel Smid¶ Abstract Let G be a geometric graph whose vertex set S is a set of n points in Rd . Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2011-01-03 00:53:54 Finite fields Computational geometry Matroid theory Tutte polynomial Factorization of polynomials over a finite field and irreducibility tests Mathematics Polynomials Elliptic curves
16	Direct Division in Factor Rings Christopher Wolf∗ Department of Mathematics ESAT-COSIC Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2004-12-18 15:04:16 Finite fields Polynomials Euclidean algorithm Greatest common divisor XTR Vehicle Identification Number Factorization of polynomials over a finite field and irreducibility tests Lenstra elliptic curve factorization Mathematics Number theory Algebra
17	HMC MATHEMATICS Sample Math Major for Students Studying Abroad in the Fall of Junior Year Fall Spring Add to Reading List Source URL: www.math.hmc.edu Language: English - Date: 2003-11-14 20:40:39 Mathematics education 11 Logic Mathematical logic Coding theory Finite fields Propositional calculus Factorization of polynomials over a finite field and irreducibility tests Mathematics Harvard University Math 55
18	Elliptic Curves in Algorithmic Number Theory and Cryptography Otto Forster §1 Applications in Algorithmic Number Theory In this section we describe briefly the use of elliptic curves over finite fields for Add to Reading List Source URL: www.mathematik.uni-muenchen.de Language: English - Date: 2003-12-07 11:29:32 Finite fields Group theory Elliptic curves Cryptography Polynomials Elliptic curve Lenstra elliptic curve factorization Division polynomials Prime number Abstract algebra Mathematics Algebra
19	Fast arithmetic and pairing evaluation on genus 2 curves David Freeman University of California, Berkeley [removed] November 6, 2005 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2008-06-06 19:27:47 Group theory Polynomial Euclidean algorithm Finite fields Elliptic curves Integer factorization algorithms Lenstra elliptic curve factorization Factorization of polynomials over a finite field and irreducibility tests Abstract algebra Mathematics Algebra
20	The University of Warwick THEORY OF COMPUTATION REPORT Add to Reading List Source URL: eprints.dcs.warwick.ac.uk Language: English - Date: 2012-04-27 07:42:11 Euclidean algorithm Polynomials Integer factorization algorithms Algebraic number theory Finite fields Factorization of polynomials over a finite field and irreducibility tests Greatest common divisor Mathematics Abstract algebra Number theory